Parallel Genetic Algorithm Based Crowding Scheme Using Neighbouring Net Topology

نویسندگان

  • P. K. Nanda
  • P. Kanungo
  • D. P. Muni
چکیده

In this article, the notion of crowding is employed to maintain stable subpopulations at niches of a multi modal nonlinear function. In this work, we have attempted to parallelize the crowding scheme and hence, propose new concepts of net topology while devising the parallel scheme based on coarse grained parallelization. Besides, we have also proposed a new interconnection model which takes care of the intra deme migration. The use of Generalized Crossover (GC) operator is found to be superior to that of the scheme using two point crossover operators. The effect of different net topology, based on the neighbourhood structure, upon the solution is investigated. It was found that the net topology with second order neighbourhood structure is good enough to yield satisfactory results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

Fast Parallel Identification of Multi-peaks in Function Optimization

A class of hybrid niching evolutionary algorithms (HNE) using clustering crowding and parallel local searching is proposed. By analyzing topology of fitness landscape and extending the space for searching similar individual, HNE determines the locality of search space more accurately, and decreases the replacement errors of crowding and suppressing genetic drift of the population. The integrati...

متن کامل

A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

متن کامل

Coarse-Grained Parallel Genetical Gorithm to Solve the Shortest Path Routing Problem Using Genetic Operators

In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003